Coding Circuits for Reducing Hamming Weight
نویسنده
چکیده
Using a newly introduced alternative to a conventional SRAM cell a binary zero can be written with a much lower power consumption than a binary one. Such a solution reduces power consumption, especially if there are few ones in the data, that is, if the data has a low Hamming weight. If the data is not inherently of low weight, this can be achieved by encoding the data. In the paper such coding is discussed and in small cases energy efficient encoding and decoding realizations are presented.
منابع مشابه
Integer Addition and Hamming Weight
We study the effect of addition on the Hamming weight of a positive integer. Consider the first 2n positive integers, and fix an α among them. We show that if the binary representation of α consists of Θ(n) blocks of zeros and ones, then addition by α causes a constant fraction of low Hamming weight integers to become high Hamming weight integers. This result has applications in complexity theo...
متن کاملComputation of Minimum Hamming Weight for Linear Codes
In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$ which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...
متن کاملBoolean Logic with Fault Tolerant Coding
Abstract: Error detectable and error correctable coding in Hamming space was researched to discover possible fault tolerant coding constellations, which can implement Boolean logic with fault tolerant property. Basic logic operators of the Boolean algebra were developed to apply fault tolerant coding in the logic circuits. It was shown that application of three-bit fault tolerant codes have pro...
متن کاملA Coding-theoretic Characterization of Finite Frobenius Rings
In this paper we show that finite rings for which the extension theorem of MacWilliams is valid for Hamming weight must necessarily be Frobenius. This result makes use of a strategy of Dinh and López-Permouth.
متن کاملRobust Correction of Repeating Errors in by Nonlinear Codes
For many devices and circuits even single faults can result in errors of a large Hamming weight at the output of a device complicating the task of error detection and correction. Traditional error detection and correction techniques are based on classical linear error detecting codes that are designed to detect or correct errors of a small multiplicity or burst errors. We present codes and arch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005